Geometric approach to graph magnitude homology

In this paper, we introduce a new method to compute magnitude homology of general graphs. To each direct sum component chain complexes, assign pair simplicial complexes whose complex is isomorphic it. First states our main theorem specialized trees, which gives another proof for the known fact that trees are diagonal. After that, consider graphs, may have cycles. We also demonstrate some computation as an application.